Morse theory of Bestvina–Brady type for posets and matchings

نویسندگان

چکیده

We introduce a Morse theory for posets of Bestvina–Brady type combining matchings and height functions. This generalizes Forman's discrete regular CW-complexes extends previous results on $h$ -regular to all finite posets. also develop relative version which allows us compare the topology poset with that given subposet.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

n ! MATCHINGS , n ! POSETS

We show that there are n! matchings on 2n points without socalled left (neighbor) nestings. We also define a set of naturally labeled (2+2)free posets and show that there are n! such posets on n elements. Our work was inspired by Bousquet-Mélou, Claesson, Dukes and Kitaev [J. Combin. Theory Ser. A. 117 (2010) 884–909]. They gave bijections between four classes of combinatorial objects: matching...

متن کامل

Computing Optimal Morse Matchings

1. I n t roduc t i on Discrete Morse theory was developed by Forman [9, 11] as a combinatorial analog to the classical smooth Morse theory. Applications to questions in combinatorial topology and related fields are numerous: e.g., Babson et al. [3], Forman [10], Batzies and Welker [4], and Jonsson [20]. I t turns out that the topologically relevant information of a discrete Morse function f on ...

متن کامل

Greedy Morse matchings and discrete smoothness

Discrete Morse theory emerged as an essential tool for computational geometry and topology. Its core structures are discrete gradient fields, defined as acyclic matchings on a complex C, from which topological and geometrical information of C can be efficiently computed, in particular its homotopy, homology, or Morse-Smale decomposition. On the geometrical side, given a function f sampled on C,...

متن کامل

Gröbner basis degree bounds on Tor k[Λ] (k, k) and discrete Morse theory for posets

The purpose of this paper is twofold. ⊲ We give combinatorial bounds on the ranks of the groups Tor • (k, k)• in the case where R = k[Λ] is an affine semi-group ring, and in the process provide combinatorial proofs for bounds by Eisenbud, Reeves and Totaro on which Tor groups vanish. In addition, we show that if the bounds hold for a field k then they hold for K[Λ] and any field K. Moreover, we...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings

سال: 2023

ISSN: ['0890-1740']

DOI: https://doi.org/10.1017/prm.2023.4